Linear Concurrent Constraint Programming over Reals

We introduce a constraint system LC that handles arithmetic constraints over reals within the linear concurrent constraint programming (lcc) framework. This approach provides us with a general, ex-tensible foundation for linear programming algorithm design that comes with a (linear) logical semantics. In particular, it allows us to build a `glass-box' version of the (constraint solver) simplex algorithm by deen-ing (monotone) cc ask and tell agents over a higher-level constraint system as lcc(LC) programs. We illustrate at the same time the use of the lccframework as a non-trivial concurrent algorithm speciication tool.